skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Search for: All records

Creators/Authors contains: "Smith, Wesley"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. Data movement is a common performance bottleneck, and its chief remedy is caching. Traditional cache management is transparent to the workload: data that should be kept in cache are determined by the recency information only, while the program information, i.e., future data reuses, is not communicated to the cache. This has changed in a new cache design named Lease Cache . The program control is passed to the lease cache by a compiler technique called Compiler Assigned Reference Lease (CARL). This technique collects the reuse interval distribution for each reference and uses it to compute and assign the lease value to each reference. In this article, we prove that CARL is optimal under certain statistical assumptions. Based on this optimality, we prove miss curve convexity, which is useful for optimizing shared cache, and sub-partitioning monotonicity, which simplifies lease compilation. We evaluate the potential using scientific kernels from PolyBench and show that compiler insertions of up to 34 leases in program code achieve similar or better cache utilization (in variable size cache) than the optimal fixed-size caching policy, which has been unattainable with automatic caching but now within the potential of cache programming for all tested programs and most cache sizes. 
    more » « less
  2. Survival of pediatric AML remains poor despite maximized myelosuppressive therapy. The pneumocystis jiroveci pneumonia (PJP)-treating medication atovaquone (AQ) suppresses oxidative phosphorylation (OXPHOS) and reduces AML burden in patient-derived xenograft (PDX) mouse models, making it an ideal concomitant AML therapy. Poor palatability and limited product formulations have historically limited routine use of AQ in pediatric AML patients. Patients with de novo AML were enrolled at two hospitals. Daily AQ at established PJP dosing was combined with standard AML therapy, based on the Medical Research Council backbone. AQ compliance, adverse events (AEs), ease of administration score (scale: 1 (very difficult)-5 (very easy)) and blood/marrow pharmacokinetics (PK) were collected during Induction 1. Correlative studies assessed AQ-induced apoptosis and effects on OXPHOS. PDX models were treated with AQ. A total of 26 patients enrolled (ages 7.2 months–19.7 years, median 12 years); 24 were evaluable. A total of 14 (58%) and 19 (79%) evaluable patients achieved plasma concentrations above the known anti-leukemia concentration (>10 µM) by day 11 and at the end of Induction, respectively. Seven (29%) patients achieved adequate concentrations for PJP prophylaxis (>40 µM). Mean ease of administration score was 3.8. Correlative studies with AQ in patient samples demonstrated robust apoptosis, OXPHOS suppression, and prolonged survival in PDX models. Combining AQ with chemotherapy for AML appears feasible and safe in pediatric patients during Induction 1 and shows single-agent anti-leukemic effects in PDX models. AQ appears to be an ideal concomitant AML therapeutic but may require intra-patient dose adjustment to achieve concentrations sufficient for PJP prophylaxis. 
    more » « less
  3. Abstract Many measurements at the LHC require efficient identification of heavy-flavour jets, i.e. jets originating from bottom (b) or charm (c) quarks. An overview of the algorithms used to identify c jets is described and a novel method to calibrate them is presented. This new method adjusts the entire distributions of the outputs obtained when the algorithms are applied to jets of different flavours. It is based on an iterative approach exploiting three distinct control regions that are enriched with either b jets, c jets, or light-flavour and gluon jets. Results are presented in the form of correction factors evaluated using proton-proton collision data with an integrated luminosity of 41.5 fb -1 at  √s = 13 TeV, collected by the CMS experiment in 2017. The closure of the method is tested by applying the measured correction factors on simulated data sets and checking the agreement between the adjusted simulation and collision data. Furthermore, a validation is performed by testing the method on pseudodata, which emulate various mismodelling conditions. The calibrated results enable the use of the full distributions of heavy-flavour identification algorithm outputs, e.g. as inputs to machine-learning models. Thus, they are expected to increase the sensitivity of future physics analyses. 
    more » « less